Five Constructions of Permutation Polynomials over $\gf(q^2)$
نویسندگان
چکیده
Four recursive constructions of permutation polynomials over GF(q2) with those over GF(q) are developed and applied to a few famous classes of permutation polynomials. They produce infinitely many new permutation polynomials over GF(q2 l ) for any positive integer l with any given permutation polynomial over GF(q). A generic construction of permutation polynomials over GF(22m) with o-polynomials over GF(2m) is also presented, and a number of new classes of permutation polynomials over GF(22m) are obtained.
منابع مشابه
The Explicit Construction of Irreducible Polynomials over Finite Fields
For a finite field GF(q) of odd prime power order q, and n > 1, we construct explicitly a sequence of monic irreducible reciprocal polynomials o f degree n2 m (m = 1, 2, 3 . . . . ) over GF(q). It is the analog for fields of odd order of constructions of Wiedemann and of Meyn over GF(2). We also deduce iterated presenn2** tations of GF(q ).
متن کاملNew Constructions of Permutation Polynomials of the Form $x^rh\left(x^{q-1}\right)$ over $\mathbb{F}_{q^2}$
Permutation polynomials over finite fields have been studied extensively recently due to their wide applications in cryptography, coding theory, communication theory, among others. Recently, several authors have studied permutation trinomials of the form xh ( x ) over Fq2 , where q = 2 , h(x) = 1+x+x and r, s, t, k > 0 are integers. Their methods are essentially usage of a multiplicative versio...
متن کاملSymplectic Spreads and Permutation Polynomials
Every symplectic spread of PG(3, q), or equivalently every ovoid of Q(4, q), is shown to give a certain family of permutation polynomials of GF (q) and conversely. This leads to an algebraic proof of the existence of the Tits-Lüneburg spread of W (2) and the Ree-Tits spread of W (3), as well as to a new family of low-degree permutation polynomials over GF (3). Let PG(3, q) denote the projective...
متن کاملThe T4 and G4 constructions for Costas arrays
B.Ya. Ryabko, " Data compression by means of a book stack, Probl. Abstract-Two of the algebraic constructions for Costas arrays, designated as T4 and C,, are described in detail, and necessary and sufficient conditions are given for the sizes of Costas arrays for which these constructions occur. These constructions depend on the existence of primitive roots satisfying certain equations in finit...
متن کاملA New Algorithm to Search for Irreducible Polynomials Using Decimal Equivalents of Polynomials over Galois Field GF(p)
In this paper a new algorithm to find the decimal equivalents of all monic irreducible polynomials (IPs) over Galois Field GF(p) has been introduced. This algorithm is effective to find the decimal equivalents of monic IPs over Galois Field with a large value of prime modulus and also with a large extension of the prime modulus. The algorithm introduced in this paper is much more time effective...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1511.00322 شماره
صفحات -
تاریخ انتشار 2015